0.00/0.05 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 180 THM 0.14/0.40 % Computer : n006.cluster.edu 0.14/0.40 % Model : x86_64 x86_64 0.14/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.14/0.40 % Memory : 8046.5625MB 0.14/0.40 % OS : Linux 6.8.0-71-generic 0.14/0.40 % CPULimit : 1440 0.14/0.40 % WCLimit : 180 0.14/0.40 % DateTime : Mon Jul 27 10:59:34 UTC 2026 0.14/0.40 % CPUTime : 0.14/0.40 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 180 THM 0.14/0.45 Running higher-order theorem proving 0.20/0.46 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.JQ5DKoomEH/E---3.1_2725652.p 0.20/0.48 % Version: 3.5.1-ho 0.20/0.48 % Preprocessing class: HSSSSLSSSLMNSFA. 0.20/0.48 % Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.20/0.48 % Starting new_ho_10 with 900s (5) cores 0.20/0.48 % Starting full_lambda_3 with 180s (1) cores 0.20/0.48 % Starting ho_unfolding_6 with 180s (1) cores 0.20/0.48 % Starting sh4l with 180s (1) cores 0.20/0.48 % full_lambda_3 with pid 2725689 completed with status 0 0.20/0.48 % Result found by full_lambda_3 0.20/0.48 % Preprocessing class: HSSSSLSSSLMNSFA. 0.20/0.48 % Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.20/0.48 % Starting new_ho_10 with 900s (5) cores 0.20/0.48 % Starting full_lambda_3 with 180s (1) cores 0.20/0.48 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = GSinE(CountTerms,hypos,1.5,,2,20000,1.0)) 0.20/0.48 % SinE strategy is GSinE(CountTerms,hypos,1.5,,2,20000,1.0) 0.20/0.48 % Search class: HHUSF-FFSS21-DSFFMSBN 0.20/0.48 % partial match(3): HHUSF-FFSF22-SSFFMSBN 0.20/0.48 % Scheduled 7 strats onto 1 cores with 180 seconds (180 total) 0.20/0.48 % Starting SubtermCWHack with 17s (1) cores 0.20/0.48 % SubtermCWHack with pid 2725693 completed with status 0 0.20/0.48 % Result found by SubtermCWHack 0.20/0.48 % Preprocessing class: HSSSSLSSSLMNSFA. 0.20/0.48 % Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.20/0.48 % Starting new_ho_10 with 900s (5) cores 0.20/0.48 % Starting full_lambda_3 with 180s (1) cores 0.20/0.48 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = GSinE(CountTerms,hypos,1.5,,2,20000,1.0)) 0.20/0.48 % SinE strategy is GSinE(CountTerms,hypos,1.5,,2,20000,1.0) 0.20/0.48 % Search class: HHUSF-FFSS21-DSFFMSBN 0.20/0.48 % partial match(3): HHUSF-FFSF22-SSFFMSBN 0.20/0.48 % Scheduled 7 strats onto 1 cores with 180 seconds (180 total) 0.20/0.48 % Starting SubtermCWHack with 17s (1) cores 0.20/0.48 % Preprocessing time : 0.001 s 0.20/0.48 0.20/0.48 % Proof found! 0.20/0.48 % SZS status Theorem 0.20/0.48 % SZS output start CNFRefutation 0.20/0.48 thf(decl_23, type, in: $i > $i > $o). 0.20/0.48 thf(decl_26, type, powerset: $i > $i). 0.20/0.48 thf(decl_27, type, dsetconstr: $i > ($i > $o) > $i). 0.20/0.48 thf(decl_28, type, dsetconstrI: $o). 0.20/0.48 thf(decl_29, type, binunion: $i > $i > $i). 0.20/0.48 thf(decl_30, type, kpair: $i > $i > $i). 0.20/0.48 thf(decl_31, type, cartprod: $i > $i > $i). 0.20/0.48 thf(decl_32, type, ubforcartprodlem3: $o). 0.20/0.48 thf(decl_33, type, esk1_0: $i). 0.20/0.48 thf(decl_34, type, esk2_0: $i). 0.20/0.48 thf(decl_35, type, esk3_0: $i). 0.20/0.48 thf(decl_36, type, esk4_0: $i). 0.20/0.48 thf(cartprodpairin, conjecture, ((dsetconstrI)=>(![X1:$i, X5:$i, X3:$i]:((![X4:$i]:(((in @ X4 @ X5)=>(in @ (kpair @ X3 @ X4) @ (cartprod @ X1 @ X5))))<=(in @ X3 @ X1)))<=(ubforcartprodlem3))), file('/export/starexec/sandbox/tmp/tmp.JQ5DKoomEH/E---3.1_2725652.p', cartprodpairin)). 0.20/0.48 thf(dsetconstrI, axiom, ((dsetconstrI)<=>![X1:$i, X2:$i > $o, X3:$i]:(((in @ X3 @ X1)=>((X2 @ X3)=>(in @ X3 @ (dsetconstr @ X1 @ (^[X4:$i]:((X2 @ X4))))))))), file('/export/starexec/sandbox/tmp/tmp.JQ5DKoomEH/E---3.1_2725652.p', dsetconstrI)). 0.20/0.48 thf(ubforcartprodlem3, axiom, ((ubforcartprodlem3)<=>![X1:$i, X5:$i, X3:$i]:(((in @ X3 @ X1)=>![X4:$i]:(((in @ X4 @ X5)=>(in @ (kpair @ X3 @ X4) @ (powerset @ (powerset @ (binunion @ X1 @ X5))))))))), file('/export/starexec/sandbox/tmp/tmp.JQ5DKoomEH/E---3.1_2725652.p', ubforcartprodlem3)). 0.20/0.48 thf(cartprod, axiom, ((cartprod)=(^[X1:$i, X5:$i]:(dsetconstr @ (powerset @ (powerset @ (binunion @ X1 @ X5))) @ (^[X3:$i]:(?[X4:$i]:((((in @ X4 @ X1))&(?[X6:$i]:((((in @ X6 @ X5))&(((X3)=(kpair @ X4 @ X6))))))))))))), file('/export/starexec/sandbox/tmp/tmp.JQ5DKoomEH/E---3.1_2725652.p', cartprod)). 0.20/0.48 thf(c_0_4, negated_conjecture, ~(((dsetconstrI)=>(![X1:$i, X5:$i, X3:$i]:((![X4:$i]:(((in @ X4 @ X5)=>(in @ (kpair @ X3 @ X4) @ (cartprod @ X1 @ X5))))<=(in @ X3 @ X1)))<=(ubforcartprodlem3)))), inference(assume_negation,[status(cth)],[cartprodpairin])). 0.20/0.48 thf(c_0_5, plain, ((dsetconstrI)<=>![X1:$i, X2:$i > $o, X3:$i]:(((in @ X3 @ X1)=>((X2 @ X3)=>(in @ X3 @ (dsetconstr @ X1 @ (^[Z0:$i]:((X2 @ Z0))))))))), inference(fof_simplification,[status(thm)],[dsetconstrI])). 0.20/0.48 thf(c_0_6, negated_conjecture, ~((![X18:$i, X19:$i > $o, X20:$i]:(((in @ X20 @ X18)=>((X19 @ X20)=>(in @ X20 @ (dsetconstr @ X18 @ X19)))))=>(![X21:$i, X22:$i, X23:$i]:(((in @ X23 @ X21)=>![X24:$i]:(((in @ X24 @ X22)=>(in @ (kpair @ X23 @ X24) @ (powerset @ (powerset @ (binunion @ X21 @ X22))))))))=>![X1:$i, X5:$i, X3:$i]:(((in @ X3 @ X1)=>![X4:$i]:(((in @ X4 @ X5)=>(in @ (kpair @ X3 @ X4) @ (cartprod @ X1 @ X5))))))))), inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_4, c_0_5]), ubforcartprodlem3])])])). 0.20/0.48 thf(c_0_7, plain, ((cartprod)=(^[Z0:$i, Z1:$i]:(dsetconstr @ (powerset @ (powerset @ (binunion @ Z0 @ Z1))) @ (^[Z2:$i]:(?[X4:$i]:((((in @ X4 @ Z0))&(?[X6:$i]:((((in @ X6 @ Z1))&(((Z2)=(kpair @ X4 @ X6))))))))))))), inference(fof_simplification,[status(thm)],[cartprod])). 0.20/0.48 thf(c_0_8, negated_conjecture, ![X25:$i, X26:$i > $o, X27:$i, X28:$i, X29:$i, X30:$i, X31:$i]:(((~(in @ X27 @ X25)|(~(X26 @ X27)|(in @ X27 @ (dsetconstr @ X25 @ X26))))&((~(in @ X30 @ X28)|(~(in @ X31 @ X29)|(in @ (kpair @ X30 @ X31) @ (powerset @ (powerset @ (binunion @ X28 @ X29))))))&((in @ esk3_0 @ esk1_0)&((in @ esk4_0 @ esk2_0)&~(in @ (kpair @ esk3_0 @ esk4_0) @ (cartprod @ esk1_0 @ esk2_0))))))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])])). 0.20/0.48 thf(c_0_9, plain, ((cartprod)=(^[Z0:$i, Z1:$i]:(dsetconstr @ (powerset @ (powerset @ (binunion @ Z0 @ Z1))) @ (^[Z2:$i]:(?[X49:$i]:((((in @ X49 @ Z0))&(?[X50:$i]:((((in @ X50 @ Z1))&(((Z2)=(kpair @ X49 @ X50))))))))))))), inference(split_conjunct,[status(thm)],[c_0_7])). 0.20/0.48 thf(c_0_10, negated_conjecture, ![X3:$i, X2:$i > $o, X1:$i]:(((in @ X1 @ (dsetconstr @ X3 @ X2))|~((in @ X1 @ X3))|~((X2 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_8])). 0.20/0.48 thf(c_0_11, plain, ![X1:$i, X3:$i]:(((dsetconstr @ (powerset @ (powerset @ (binunion @ X1 @ X3))) @ (^[Z0:$i]:(?[X51:$i]:((((in @ X51 @ X1))&(?[X52:$i]:((((in @ X52 @ X3))&(((Z0)=(kpair @ X51 @ X52)))))))))))=(cartprod @ X1 @ X3))), inference(arg_cong,[status(thm)],[c_0_9])). 0.20/0.48 thf(c_0_12, negated_conjecture, ![X1:$i, X3:$i, X4:$i]:(((in @ X1 @ (cartprod @ X3 @ X4))|~(?[X53:$i]:(((in @ X53 @ X3)&?[X54:$i]:(((in @ X54 @ X4)&((X1)=(kpair @ X53 @ X54)))))))|~((in @ X1 @ (powerset @ (powerset @ (binunion @ X3 @ X4))))))), inference(spm,[status(thm)],[c_0_10, c_0_11])). 0.20/0.48 thf(c_0_13, negated_conjecture, ![X1:$i, X3:$i, X4:$i, X5:$i]:(((in @ (kpair @ X1 @ X4) @ (powerset @ (powerset @ (binunion @ X3 @ X5))))|~((in @ X1 @ X3))|~((in @ X4 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_8])). 0.20/0.48 thf(c_0_14, negated_conjecture, ~((in @ (kpair @ esk3_0 @ esk4_0) @ (cartprod @ esk1_0 @ esk2_0))), inference(split_conjunct,[status(thm)],[c_0_8])). 0.20/0.48 thf(c_0_15, negated_conjecture, ![X1:$i, X3:$i, X4:$i, X5:$i]:(((in @ (kpair @ X1 @ X3) @ (cartprod @ X4 @ X5))|~((in @ X1 @ X4))|~((in @ X3 @ X5)))), inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_12])]), c_0_13])). 0.20/0.48 thf(c_0_16, negated_conjecture, (in @ esk3_0 @ esk1_0), inference(split_conjunct,[status(thm)],[c_0_8])). 0.20/0.48 thf(c_0_17, negated_conjecture, (in @ esk4_0 @ esk2_0), inference(split_conjunct,[status(thm)],[c_0_8])). 0.20/0.48 thf(c_0_18, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_16]), c_0_17])]), ['proof']). 0.20/0.48 % SZS output end CNFRefutation 0.20/0.48 % Parsed axioms : 15 0.20/0.48 % Removed by relevancy pruning/SinE : 10 0.20/0.48 % Initial clauses : 7 0.20/0.48 % Removed in clause preprocessing : 0 0.20/0.48 % Initial clauses in saturation : 7 0.20/0.48 % Processed clauses : 16 0.20/0.48 % ...of these trivial : 2 0.20/0.48 % ...subsumed : 0 0.20/0.48 % ...remaining for further processing : 14 0.20/0.48 % Other redundant clauses eliminated : 1 0.20/0.48 % Clauses deleted for lack of memory : 0 0.20/0.48 % Backward-subsumed : 0 0.20/0.48 % Backward-rewritten : 0 0.20/0.48 % Generated clauses : 12 0.20/0.48 % ...of the previous two non-redundant : 9 0.20/0.48 % ...aggressively subsumed : 0 0.20/0.48 % Contextual simplify-reflections : 1 0.20/0.48 % Paramodulations : 4 0.20/0.48 % Factorizations : 0 0.20/0.48 % NegExts : 0 0.20/0.48 % Equation resolutions : 1 0.20/0.48 % Disequality decompositions : 0 0.20/0.48 % Total rewrite steps : 6 0.20/0.48 % ...of those cached : 0 0.20/0.48 % Propositional unsat checks : 0 0.20/0.48 % Propositional check models : 0 0.20/0.48 % Propositional check unsatisfiable : 0 0.20/0.48 % Propositional clauses : 0 0.20/0.48 % Propositional clauses after purity: 0 0.20/0.48 % Propositional unsat core size : 0 0.20/0.48 % Propositional preprocessing time : 0.000 0.20/0.48 % Propositional encoding time : 0.000 0.20/0.48 % Propositional solver time : 0.000 0.20/0.48 % Success case prop preproc time : 0.000 0.20/0.48 % Success case prop encoding time : 0.000 0.20/0.48 % Success case prop solver time : 0.000 0.20/0.48 % Current number of processed clauses : 13 0.20/0.48 % Positive orientable unit clauses : 9 0.20/0.48 % Positive unorientable unit clauses: 0 0.20/0.48 % Negative unit clauses : 1 0.20/0.48 % Non-unit-clauses : 3 0.20/0.48 % Current number of unprocessed clauses: 0 0.20/0.48 % ...number of literals in the above : 0 0.20/0.48 % Current number of archived formulas : 0 0.20/0.48 % Current number of archived clauses : 1 0.20/0.48 % Clause-clause subsumption calls (NU) : 1 0.20/0.48 % Rec. Clause-clause subsumption calls : 1 0.20/0.48 % Non-unit clause-clause subsumptions : 1 0.20/0.48 % Unit Clause-clause subsumption calls : 0 0.20/0.48 % Rewrite failures with RHS unbound : 0 0.20/0.48 % BW rewrite match attempts : 2 0.20/0.48 % BW rewrite match successes : 0 0.20/0.48 % Condensation attempts : 0 0.20/0.48 % Condensation successes : 0 0.20/0.48 % Termbank termtop insertions : 1584 0.20/0.48 % Search garbage collected termcells : 303 0.20/0.48 0.20/0.48 % ------------------------------------------------- 0.20/0.48 % User time : 0.006 s 0.20/0.48 % System time : 0.000 s 0.20/0.48 % Total time : 0.006 s 0.20/0.48 % Maximum resident set size: 3640 pages 0.20/0.48 0.20/0.48 % ------------------------------------------------- 0.20/0.48 % User time : 0.009 s 0.20/0.48 % System time : 0.003 s 0.20/0.48 % Total time : 0.012 s 0.20/0.48 % Maximum resident set size: 4864 pages 0.20/0.48 % E exiting 0.20/0.48 EOF